A factoring and discrete logarithm based cryptosystem
نویسندگان
چکیده
منابع مشابه
A Factoring and Discrete Logarithm based Cryptosystem
This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined during the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient publi...
متن کاملAn ID-Based Public Key Cryptosystem based on Integer Factoring and Double Discrete Logarithm Problem
In 1984, Shamir [1] introduced the concept of an identity-based cryptosystem. In this system, each user needs to visit a key authentication center (KAC) and identify him self before joining a communication network. Once a user is accepted, the KAC will provide him with a secret key. In this way, if a user wants to communicate with others, he only needs to know the “identity” of his communicatio...
متن کاملFactoring and Discrete Logarithm using IBC
In 1984, Shamir proposed the concept of the ID-based cryptosystem (IBC). Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large public key file is not required. ...
متن کاملA Knapsack Cryptosystem Based on The Discrete Logarithm Problem
This paper introduces a knapsack cryptosystem based on the problem of discrete logarithm. The proposed algorithm obtains the public knapsack values by finding the discrete logarithms of the secret knapsack ones. Also, it encrypts the message block by obtaining its binary bits and then computing the modular multiplication of the public knapsack values corresponding to the 1-bits of the binary fo...
متن کاملA Cryptosystem based on Double Generalized Discrete Logarithm Problem
This paper introduces mainly the concept of public key cryptosystem, whose security is based on double generalized discrete logarithm problem with distinct discrete exponents in the multiplicative group of finite fields. We show that the proposed public key cryptosystem based on double generalized discrete logarithm problem, provides more security because of double computation comparing with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Contemporary Mathematical Sciences
سال: 2013
ISSN: 1314-7544
DOI: 10.12988/ijcms.2013.13050